A Matching Problem and Subadditive Euclidean Functionals
نویسندگان
چکیده
منابع مشابه
Tail Probabilities of Subadditive Functionals
We study the tail behavior of the distribution of certain subadditive functionals acting on the sample paths of L evy processes. The functionals we consider have, roughly speaking, the following property: only the points of the process that lie above a certain curve contribute to the value of the functional. Our assumptions will make sure that the process ends up eventually below the curve. Our...
متن کاملThe quadratic stochastic Euclidean bipartite matching problem
We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of N points each, N 1. The points are supposed independently randomly generated on a domain Ω ⊂ Rd with a given distribution ρ(x) on Ω. In particular, we derive a general expression for the correlation function and for the average optimal cost of the optimal matching. A prev...
متن کاملA Scaling Hypothesis for the Euclidean Bipartite Matching Problem
We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic prediction of the large N limit of the average cost in dimension d = 1,2 and of the subleading correction in higher dimension. A nontrivial scaling exponent,...
متن کاملAn Optimal Matching Problem for the Euclidean Distance
We deal with an optimal matching problem, that is, we want to transport two measures to a given place, where they will match, minimizing the total transport cost that in our case is given by the sum of the Euclidean distance that each measure is transported. We show that such a problem has a solution. Furthermore we perform a method to approximate the solution of the problem taking limit as p→∞...
متن کاملOne-loop diagrams in the Random Euclidean Matching Problem
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e., the optimal matching problem between points randomly distributed on a d-dimensional Euclidean space, where the cost to minimize depends on the points' pairwise distances. Using May...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1993
ISSN: 1050-5164
DOI: 10.1214/aoap/1177005364